Equational Properties of Iteration in Algebraically Complete Categories
نویسندگان
چکیده
We prove the following completeness theorem: If the fixed point operation over a category is defined by initial@, then the equations satisfied by the fixed point operation are exactly those of iteration theories. Thus, in such categories, the equational axioms of iteration theories provide a sound and complete axiomatization of the equational properties of the fixed point operation.
منابع مشابه
Equational axioms associated with finite automata for fixed point operations in cartesian categories
The axioms of iteration theories, or iteration categories, capture the equational properties of fixed point operations in several computationally significant categories. Iteration categories may be axiomatized by the Conway identities and identities associated with finite automata. We show that the Conway identities and the identities associated with the members of a subclass Q of finite automa...
متن کاملHow Algebraic Is Algebra?
The 2-category VAR of finitary varieties is not varietal over CAT . We introduce the concept of an algebraically exact category and prove that the 2-category ALG of all algebraically exact categories is an equational hull of VAR w.r.t. all operations with rank. Every algebraically exact category K is complete, exact, and has filtered colimits which (a) commute with finite limits and (b) distrib...
متن کاملComplete Axioms for Categorical Fixed-Point Operators
We give an axiomatic treatment of fixed-point operators in categories. A notion of iteration operator is defined, embodying the equational properties of iteration theories. We prove a general completeness theorem for iteration operators, relying on a new, purely syntactic characterisation of the free iteration theory. We then show how iteration operators arise in axiomatic domain theory. One re...
متن کاملSome Remarks on Conway and Iteration Theories
We present an axiomatization of Conway theories which yields, as a corollary, a very concise axiomatization of iteration theories satisfying the functorial implication for base morphisms. It has been shown that most fixed point operations in computer science share the same equational properties. These equational properties are captured by the notion of iteration theories [1, 3]. Several axiomat...
متن کاملGreibach Normal Form in Algebraically Complete Semirings
We give inequational and equational axioms for semirings with a fixed-point operator and formally develop a fragment of the theory of context-free languages. In particular, we show that Greibach’s normal form theorem depends only on a few equational properties of least pre-fixed-points in semirings, and elimination of chainand deletion rules depend on their inequational properties (and the idem...
متن کامل